Analyzing Tabular and State-Transition Requirements Specifications in PVS

نویسندگان

  • Sam Owre
  • John Rushby
  • Natarajan Shankar
چکیده

\_' (lescribe PVS's capabilities for representing tabular specifications of the kind advocated t)y Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS_s TCCs can expose and help isolate errors in the latter. We extend this approach to represent the mode transition tables of the Software Cost Reduction (SCR) method in an attractive rammer. We show how PVS can check these tables for well-formedness, and how PVS's model checking capalfilities can he used to verify invariants and reaehability properties of SCR requirelnents specifications, and inclusion relations between the behaviors of different specifications. These exalnples demonstrate how sew_ral capabilities of the PVS language and verification system can be used in combination to provide customized support for specific methodologies for documellting and analyzing requirements. Because they use only the standard capabilities of PVS, users can adapt and extend these customizations to suit their own needs. Those developing dedicated tools for individual methodologies may find these constructions in PVS helpful for prototyping purposes. or as a useful adjunct to a dedicated tool when the capabilities of a flfll theorem prover are required. The examples also illustrate the power and utility of an integrated generalpurpose system such as PVS. For example, there was no need to adapt or extend the PVS model checker to make it work with SCR specifications (lescribed using the PVS TABLE construct: the model checker is applicable to any transition relation, independently of the PVS language constructs used in its definition. PVS specification files for several of the examples used here can be downloa(led from http://www, csl. sri. com/pvs/examples/tables; PVS itself is available at http ://www. csi. sr±. com/pvs, html.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing Tabular and State-transition Requirements Speciications in Pvs 1

We describe PVS's capabilities for representing tabular speci cations of the kind advocated by Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS's TCC...

متن کامل

Applying infinite state model checking and other analysis techniques to tabular requirements specifications of safety-critical systems

Although it is most often applied to finite state models, in recent years, symbolic model checking has been extended to infinite state models using symbolic representations that encode infinite sets. This paper investigates the application of an infinite state symbolic model checker called Action Language Verifier (ALV) to formal requirements specifications of safety-critical systems represente...

متن کامل

Integration in PVS: Tables, Types, and Model Checking

We have argued previously that the effectiveness of a verification system derives not only from the power of its individual features for expression and deduction, but from the extent to which these capabilities are integrated: the whole is more than the sum of its parts [20,21]. Here, we illustrate this thesis by describing a simple construct for tabular specifications that was recently added t...

متن کامل

Tabular Notations for State Machine-Based Specifications

T term reactive system describes a system that needs to continuously react to inputs coming from the environment. Finite state machines are a widely used concept for specifying the behavior of such systems. Since finite state machines allow the rigorous capture of functional aspects of system behavior, they offer several advantages over informal specifications. For example, they provide the abi...

متن کامل

Analyzing Behavioural Scenarios over Tabular Specifications Using Model Checking

Tabular notations, in particular SCR specifications, have proved to be a useful means for formally describing complex requirements. The SCR method offers a powerful family of analysis tools, known as the SCR Toolset, but its availability is restricted by the Naval Research Laboratory of the USA. This toolset applies different kinds of analysis considering the whole set of behaviours associated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995